Note on an embedding theorem of Adyan

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Dilworth's Embedding Theorem

The dimension of a poset X is the smallest positive integer t for which there exists an embedding of X in the cartesian product of t chains. R. P. Dilworth proved that the dimension of a distributive lattice v L = 2_ is the width of X. In this paper we derive an analogous result for embedding distributive lattices in the cartesian product of chains of bounded length. We prove that for each k > ...

متن کامل

Effects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)

The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

Note on an n-dimensional Pythagorean theorem

A famous theorem in Euclidean geometry often attributed to the Greek thinker Pythagoras of Samos (6th century, B.C.) states that if one of the angles of a planar triangle is a right angle, then the square of the length of the side opposite the right angle equals the sum of the squares of the lengths of the sides which form the right angle. There are less commonly known higherdimensional version...

متن کامل

A Note on Embedding Hypertrees

A classical result from graph theory is that every graph with chromatic number χ > t contains a subgraph with all degrees at least t, and therefore contains a copy of every t-edge tree. Bohman, Frieze, and Mubayi recently posed this problem for r-uniform hypergraphs. An r-tree is an runiform hypergraph with no pair of edges intersecting in more than one vertex, and no sequence of distinct verti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1963

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1963-0155918-1